On the Shuffle Automaton Size for Words
نویسندگان
چکیده
We investigate the state size of DFAs accepting the shuffle of two words. We provide words u and v, such that the minimal DFA for u v requires an exponential number of states. We also show some conditions for the words u and v which ensure a quadratic upper bound on the state size of u v. Moreover, switching only two letters within one of u or v is enough to trigger the change from quadratic to exponential.
منابع مشابه
Shuffle of Words and Araucaria Trees
The shuffle of words ,. . . , is the set of words obtained by interleaving the letters of these words such that the order of appearance of all letters of each word is respected. The study of the shuffle product of words leads to the construction of an automaton whose structure is deeply connected to a family of trees which we call araucarias. We prove many structural properties of this family o...
متن کاملFinding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access
In the present paper, we introduce and study the problem of computing, for any given finite set of words, a shuffle word with a minimum so-called scope coincidence degree. The scope coincidence degree is the maximum number of different symbols that parenthesise any position in the shuffle word. This problem is motivated by an application of a new automaton model and can be regarded as the probl...
متن کاملAssociativity of Infinite Synchronized Shuffles and Team Automata
Motivated by different ways to obtain team automata from synchronizing component automata, we consider various definitions of synchronized shuffles of words. A shuffle of two words is an interleaving of their symbol occurrences which preserves the original order of these occurrences within each of the two words. In a synchronized shuffle, however, also two occurrences of one symbol, each from a...
متن کاملOn the State Complexity of the Shuffle of Regular Languages
We investigate the shuffle operation on regular languages represented by complete deterministic finite automata. We prove that f(m,n) = 2+2(2−1)(2−1) is an upper bound on the state complexity of the shuffle of two regular languages having state complexities m and n, respectively. We also state partial results about the tightness of this bound. We show that there exist witness languages meeting ...
متن کاملOn the complexity and decidability of some problems involving shuffle
The complexity and decidability of various decision problems involving the shuffle operation (denoted by ) are studied. The following three problems are all shown to be NP-complete: given a nondeterministic finite automaton (NFA) M , and two words u and v, is L(M) 6⊆ u v, is u v 6⊆ L(M), and is L(M) 6= u v? It is also shown that there is a polynomial-time algorithm to determine, for NFAs M1,M2 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Automata, Languages and Combinatorics
دوره 15 شماره
صفحات -
تاریخ انتشار 2010